Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time
نویسندگان
چکیده
منابع مشابه
Improved Distributed $\Delta$-Coloring
We present a randomized distributed algorithm that computes a ∆-coloring in any noncomplete graph with maximum degree ∆ ≥ 4 in O(log∆) + 2 √ log logn) rounds, as well as a randomized algorithm that computes a ∆-coloring in O((log logn)) rounds when ∆ ∈ [3, O(1)]. Both these algorithms improve on an O(log n/ log∆)-round algorithm of Panconesi and Srinivasan [STOC’1993], which has remained the st...
متن کاملDistributed $(\Delta+1)$-Coloring in Sublogarithmic Rounds
The (∆+1)-coloring problem is a fundamental symmetry breaking problem in distributed computing. We give a new randomized coloring algorithm for (∆ + 1)-coloring running in O( √ log ∆) + 2O( √ log logn) rounds with probability 1 − 1/nΩ(1) in a graph with n nodes and maximum degree ∆. This implies that the (∆ + 1)-coloring problem is easier than the maximal independent set problem and the maximal...
متن کاملDistributed (Δ+1)-Coloring in Linear (in Δ) Time
The distributed (∆ + 1)-coloring problem is one of most fundamental and well-studied problems in Distributed Algorithms. Starting with the work of Cole and Vishkin in 86, there was a long line of gradually improving algorithms published. The current state-of-the-art running time is O(∆ log ∆+log∗ n), due to Kuhn and Wattenhofer, PODC’06. Linial (FOCS’87) has proved a lower bound of 1 2 log∗ n f...
متن کاملFault Tolerant Distributed Coloring Algorithms that Stabilize in Linear Time
We propose two new self-stabilizing distributed algorithms for proper +1 ( is the maximum degree of a node in the graph) coloring of arbitrary system graphs. Both algorithms are capable of working with multiple types of demons (schedulers) as is the most recent algorithm in [1]. The first algorithm converges in O(m) moves while the second converges in at most n moves (n is the number of nodes a...
متن کاملAn Optimal Distributed $(\Delta+1)$-Coloring Algorithm?
Vertex coloring is one of the classic symmetry breaking problems studied in distributed com-puting. In this paper we present a new algorithm for (∆ + 1)-list coloring in the randomizedLOCAL model running in O(log n + Detd(poly logn)) time, where Detd(n ′) is the determinis-tic complexity of (deg+1)-list coloring (v’s palette has size deg(v) + 1) onn′-vertex graphs.This impro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2014
ISSN: 0097-5397,1095-7111
DOI: 10.1137/12088848x